Permutation Groups, Vertex-transitive Digraphs and Semiregular Automorphisms

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Permutation Groups, Vertex-transitive Digraphs and Semiregular Automorphisms

A nonidentity element of a permutation group is said to be semiregular if all of its orbits have the same length. The work in this paper is linked to [6] where the problem of existence of semiregular automorphisms in vertex-transitive digraphs was posed. It was observed there that every vertex-transitive digraph of order pk or mp, where p is a prime, k 1 and m p are positive integers, has a sem...

متن کامل

Semiregular Automorphisms of Cubic Vertex Transitive Graphs

It is shown that for a connected cubic graph Γ , a vertex transitive group G ≤ AutΓ contains a large semiregular subgroup. This confirms a conjecture of Cameron and Sheehan (2001).

متن کامل

Semiregular Automorphisms of Cubic Vertex-transitive Graphs

We characterise connected cubic graphs admitting a vertextransitive group of automorphisms with an abelian normal subgroup that is not semiregular. We illustrate the utility of this result by using it to prove that the order of a semiregular subgroup of maximum order in a vertex-transitive group of automorphisms of a connected cubic graph grows with the order of the graph, settling [2, Problem ...

متن کامل

Semiregular automorphisms of vertex-transitive cubic graphs

An old conjecture of Marušič, Jordan and Klin asserts that any finite vertextransitive graph has a non-trivial semiregular automorphism. Marušič and Scapellato proved this for cubic graphs. For these graphs, we make a stronger conjecture, to the effect that there is a semiregular automorphism of order tending to infinity with n. We prove that there is one of order greater than 2.

متن کامل

Transitive Permutation Groups without Semiregular Subgroups

A transitive finite permutation group is called elusive if it contains no nontrivial semiregular subgroup. The purpose of the paper is to collect known information about elusive groups. The main results are recursive constructions of elusive permutation groups, using various product operations and affine group constructions. A brief historical introduction and a survey of known elusive groups a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: European Journal of Combinatorics

سال: 1998

ISSN: 0195-6698

DOI: 10.1006/eujc.1997.0192